package DataStructureAndAlgorithm.AcWing_每日一题.枚举;
import java.util.Scanner;
//链接：https://www.acwing.com/problem/content/3788/
public class AcWing_3785 {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        String[] str = new String[n + 1];

        for (int i = 1; i <= n; i++){
            str[i] = in.next();
        }

        int x = 1,y = 1,res = 0;

        for (int i = 1; i <= n; i++){
            for (int j = 0; j < n; j++){
                if (str[i].charAt(j) == '#')continue;

                int l = j,r = j;

                while (l >= 0 && str[i].charAt(l) == '.' && j - l + 1 <= k)l--;
                while (r < n && str[i].charAt(r) == '.' && r - j + 1 <= k)r++;
                int t = Math.max(0,r - l - k);
                l = i;
                r = i;
                while (l >= 1 && str[l].charAt(j) == '.' && i - l + 1 <= k)l--;
                while (r <= n && str[r].charAt(j) == '.' && r - i + 1 <= k)r++;

                t += Math.max(0,r - l - k);

                if (t > res){
                    res = t;
                    x = i;
                    y = j + 1;
                }
            }
        }

        System.out.println(x + " " + y);
        in.close();
    }
}
